Cayley, Sylvester, and Early Matrix Theory

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Construction of Generic Mixed Cayley-Sylvester Resultant Matrix

For a generic n-degree polynomial system which contains n+1 polynomials in n variables, we give the construction of the generic mixed Cayley-Sylvester resultant matrix. There are n− 1 generic mixed Cayley-Sylvester resultant matrices between the classical Cayley resultant matrix and the classical Sylvester resultant matrix. The entries of these new resultant matrix are of degree m(1 < m < n + 1...

متن کامل

An extension of the Cayley-Sylvester formula

We extend the Cayley-Sylvester formula for symmetric powers of SL2(C)modules, to plethysms defined by rectangle partitions. Ordinary partitions are replaced by plane partitions, and an extension of the Hermite reciprocity law follows. 1. Let Sd denote the irreducible SL2(C)-module of dimension d + 1, which can be identified with the space of homogeneous polynomials of degree d in two variables....

متن کامل

Analogue of Sylvester-cayley Formula for Invariants of Ternary Form

The number ν d (n) of linearly independed homogeneous invariants of degree n for the ternary form of degree d is calculated. The folloving formula is hold is number of nonnegative integer solutions of the system of equations

متن کامل

The Sylvester Resultant Matrix and Image Deblurring

This paper describes the application of the Sylvester resultant matrix to image deblurring. In particular, an image is represented as a bivariate polynomial and it is shown that operations on polynomials, specifically greatest common divisor (GCD) computations and polynomial divisions, enable the point spread function to be calculated and an image to be deblurred. The GCD computations are perfo...

متن کامل

On the numerical solution of generalized Sylvester matrix equations

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2008

ISSN: 0024-3795

DOI: 10.1016/j.laa.2007.10.004